📝 Lecture Notes
Access comprehensive lecture notes and study materials
🏷️ Filter by Subject
Lecture 05
Heap Sort & Analysis of Algorithms
Date:9/18/2024
Subject:Design and Analysis of Algorithms
Going through Heap Sort Algo
Lecture Notes
Read Notes
Lecture 04
Solving Recurrences (Recursion Tree, Master Theorem) & Divide and Conquer Algorithms (Merge Sort, Quick Sort, Heap Sort)
Date:9/13/2024
Subject:Design and Analysis of Algorithms
This lecture covers solving recurrence relations, including the recursion tree method and the master theorem. It also introduces divide and conquer algorithms, such as merge sort, quick sort, and heap sort.
Lecture Notes
Read Notes
Lecture 03
O(N^2) Sorting Algorithms and Introduction to Recurrence Relations
Date:9/6/2024
Subject:Design and Analysis of Algorithms
This lecture is about sorting alogorithms and recurrence relations.
Lecture Notes
Read Notes
Lecture 01
Introduction to Algorithms
Date:6/28/2024
Subject:Design and Analysis of Algorithms
This lecture will explore the basics of algorithms, including the definition of an algorithm, its characteristics, and the importance of algorithm design and analysis.
Lecture Notes
Read Notes
Lecture 02
Code And Analysis of Algorithms
Date:6/28/2024
Subject:Design and Analysis of Algorithms
This lecture will explore the basics of algorithms, including code and analysis of algorithms.
Lecture Notes
Read Notes